A Fuzzy Time in LTL

نویسندگان

  • ACHILLE FRIGERI
  • LILIANA PASQUALE
  • PAOLA SPOLETINI
چکیده

In the last years, the adoption of adaptive systems has increased in many fields of computer science, such as databases and software engineering. These systems are able to automatically react to events, by collecting information from the external environment and generating new events. However, the collection of data is often hampered by uncertainty and vagueness. The decision making mechanism used to produce a reaction is also imprecise and cannot be evaluated in a crisp way, as it depends on vague temporal constraints expressed by humans. Logic has been extensively used as an abstraction to express vagueness in the satisfaction of system properties, as well as to enrich existing modeling formalisms. However, existing attempts to fuzzify the temporal modalities have still some limitations. Existing fuzzy temporal languages are generally obtained from classical temporal logic by replacing classical connectives or propositions with their fuzzy counterparts. Hence, these languages do not allow us to represent temporal properties, such as “almost always” and “soon”, in which the notion of time is inherently fuzzy. To overcome these limitations, we propose a temporal framework, FTL (Fuzzy-time Temporal Logic), to express vagueness on time. This framework formally defines a set of fuzzy temporal modalities, which can be customized by choosing a specific semantics for the connectives. The semantics of the language is sound, and the introduced modalities respect a set of mutual relations. We also prove that under the assumption that all events are crisp, FTL reduces to LTL. Moreover, for some of the possible fuzzy interpretations of the connectives, we identify adequate sets of temporal operators, from which it is possible to derive all the other ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Time in LTL

In the last years, the adoption of active systems has increased in many fields of computer science, such as databases, sensor networks, and software engineering. These systems are able to automatically react to events, by collecting information from outside and internally generating new events. However, the collection of data is often hampered by uncertainty and vagueness that can arise from th...

متن کامل

EAGLE does Space Efficient LTL Monitoring

We briefly present a rule-based framework, called EAGLE, that has been shown to be capable of defining and implementing finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time and metric temporal logics (MTL), interval logics, forms of quantified temporal logics, and so on. In this paper we show how EAGLE can perform linear temporal...

متن کامل

Embedding-based Approaches to Temporal Logics: a Survey

Embedding LTL into IL. Linear-time temporal logic (LTL) is known to be one of the most useful logics in Computer Science, and infinitary logic (IL) is known to be an important logic in Mathematical Logic. The research fields of both LTL and IL have independently developed each other, and the relationship between them has not yet been discussed. In [1], the relationship between LTL and IL was cl...

متن کامل

Leukocyte Telomere Length and Cancer Risk: A Dynamic Problem

Telomeres are the protective structure at both ends of each chromoThe decelerating age-adjusted LTL attrition in cancer cases as they some. Telomere length is widely considered a marker of biological aging. For convenience, telomere lengths in human population studies have been predominately measured in peripheral blood leukocytes. Although leukocyte telomere length (LTL) is generally inversely...

متن کامل

An Abstract Interpretation Perspective on Linear vs. Branching Time

It is known that the branching time language ACTL and the linear time language ∀LTL of universally quantified formulae of LTL have incomparable expressive powers, i.e., Sem(ACTL) and Sem(∀LTL) are incomparable sets. Within a standard abstract interpretation framework, ACTL can be viewed as an abstract interpretation LTL∀ of LTL where the universal path quantifier ∀ abstracts each linear tempora...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014